Finding Robust Solutions to Multi-objective Optimisation Problems Using Polynomial Chaos

نویسندگان

  • A. Molina-Cristobal
  • G. T. Parks
  • P. J. Clarkson
چکیده

If an optimal solution is very sensitive to perturbations, then it may not be the most appropriate solution to use. In situations where natural variation is inevitable, it is therefore necessary to find a robust optimal solution. This paper examines emerging techniques for finding robust solutions to multiobjective optimisation problems. One of the major concerns in robust optimisation is that accounting for the robustness of solutions makes the problem much more computationally expensive. It is shown that the polynomial chaos approach addresses this key issue by decomposing the stochastic process into its deterministic and random process parts. A practical problem, design of an electrical RLC circuit, is used to illustrate the effectiveness of the approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evolutionary Approach to Active Robust Multiobjective Optimisation

An Active Robust Optimisation Problem (AROP) aims at finding robust adaptable solutions, i.e. solutions that actively gain robustness to environmental changes through adaptation. Existing AROP studies have considered only a single performance objective. This study extends the Active Robust Optimisation methodology to deal with problems with more than one objective. Once multiple objectives are ...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

A Polynomial Chaos Approach to Robust Multiobjective Optimization

Robust design optimization is a modeling methodology, combined with a suite of computational tools, which is aimed to solve problems where some kind of uncertainty occurs in the data or in the model. This paper explores robust optimization complexity in the multiobjective case, describing a new approach by means of Polynomial Chaos expansions (PCE). The aim of this paper is to demonstrate that ...

متن کامل

On the Disruption-level of Polynomial Mutation for Evolutionary Multi-objective Optimisation Algorithms

This paper looks at two variants of polynomial mutation used in various evolutionary optimisation algorithms for mutliobjective problems. The first is a non-highly disruptive and the second is a highly disruptive mutation. Both are used for problems with box constraints. A new hybrid polynomial mutation that combines the benefits of both is proposed and implemented. The experiments with three e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006